Euler arc splines for curve completion

نویسندگان

  • Hailing Zhou
  • Jianmin Zheng
  • Xunnian Yang
چکیده

This paper introduces a special arc spline called an Euler arc spline as the basic form for visually pleasing completion curves. It is considered as an extension of an Euler curve in the sense that the points in the Euler curve are replaced by arcs. A simple way for specifying it, which is suitable for shape completion, is presented. It is shown that Euler arc splines have several properties desired by aesthetics of curves, in addition to computational simplicity and NURBS representation. An algorithm is proposed for curve completion using Euler arc splines. The development of the algorithm involves two optimization processes, which are converted into a single minimization problem in two variables solved by the Levenberg–Marquardt algorithm. Compared to previous methods, the proposed algorithm always guarantees the interpolation of two boundary conditions. & 2012 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Curve fitting with arc splines for NC toolpath generation

Arc splines are important in automatically controlled complex curve cutting process. However, the problem of how to determine the parameter of arcs according to desired curve fitting accuracy has not been completely solved. This paper presents a new algorithm for finding arbitrarily close bi-arc splines. It is based on research on the characteristics of spiral curves. The algorithm has several ...

متن کامل

Bisection algorithms for approximating quadratic Bézier curves by G1 arc splines

To describe the tool path of a CNC machine, it is often necessary to approximate curves by G arc splines with the number of arc segments as small as possible. Ahn et al. have proposed an iterative algorithm for approximating quadratic Bézier curves by G arc splines with fewer arc segments than the biarc method. This paper gives the formula of the upper bound for arc segments used by their algor...

متن کامل

Interpolating Splines : Which is the fairest of them all ?

Interpolating splines are a basic primitive for designing planar curves. There is a wide diversity in the literature but no consensus on a ―best‖ spline, or even criteria for preferring one spline over another. For the case of G-continuous splines, we emphasize two properties that can arguably be expected in any definition of ―best‖ and show that any such spline is made from segments cut from a...

متن کامل

Variational Study of Nonlinear Splinecurves

This is of nonlinear an exposition of the variational and differential properties spline curves, based on the Euler-Bernoulli theory for the bending of thin beams or elastica. For both open and closed splines through prescribed nodal points in the euclidean plane, various types --. of nodal constraints are considered, and the corresponding algebraic and differential equations relating curvature...

متن کامل

Global regularity and convergence of a Birkhoff-Rott-α approximation of the dynamics of vortex sheets of the 2D Euler equations

We present an α-regularization of the Birkhoff-Rott equation, induced by the two-dimensional Euler-α equations, for the vortex sheet dynamics. We show the convergence of the solutions of Euler-α equations to a weak solution of the Euler equations for initial vorticity being a finite Radon measure of fixed sign, which includes the vortex sheets case. We also show that, provided the initial densi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Graphics

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2012